The $3x+1$ problem: a lower bound hypothesis
نویسندگان
چکیده
منابع مشابه
A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...
متن کاملA Lower Bound for Heilbronn's Problem
We disprove Heilbronn's conjecture—that N points lying in the unit disc necessarily contain a triangle of area less than c/N. Introduction We think that the best account of the problem can be achieved by simply copying the corresponding paragraphs from Roth's paper [6]. "Let Pv, P2,..., Pn (where n ^ 3) be a distribution of n points in a (closed) disc of unit area, such that the minimum of the ...
متن کاملLower Bound for the Unique Games Problem
We consider a randomized algorithm for the unique games problem, using independent multinomial probabilities to assign labels to the vertices of a graph. The expected value of the solution obtained by the algorithm is expressed as a function of the probabilities. Finding probabilities that maximize this expected value is shown to be equivalent to obtaining an optimal solution to the unique game...
متن کاملA Lower Bound for the Job Insertion Problem
This note deals with the job insertion problem in job-shop scheduling: Given a feasible schedule of n jobs and a new job which is not scheduled, the problem is to 3nd a feasible insertion of the new job into the schedule which minimises the makespan. Since the problem is NP-hard, a relaxation method is proposed to compute a strong lower bound. Conditions under which the relaxation provides us w...
متن کاملA Lower Bound for the Weighted Completion Time Variance Problem
We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard in the strong sense. We propose a lower bound based on splitting of jobs and the Viswanathkumar and Srinivasan procedure and a heuristic. The test on more than 2000 instances shows that this lower bound is very tight.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Functiones et Approximatio Commentarii Mathematici
سال: 2017
ISSN: 0208-6573
DOI: 10.7169/facm/1583